#include"BinarySearchTree.h"
 void Test()
{
     int a[] = {2,8,5,9,10,3,7};
     BSTree<int> t;
     for (auto e : a)
     {
        t.InsertR(e);
     }

     t.InOrder();
     //cout<<endl;
     BSTree<int> t1(t);
     t.InOrder();

   
}
int main()
{
    Test();
	return 0;
}